Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

A probabilistic top-down parser for minimalist grammars

This paper describes a probabilistic top-down parser for minimalist grammars. Top-down parsers have the great advantage of having a certain predictive power during the parsing, which takes place in a left-to-right reading of the sentence. Such parsers have already been well-implemented and studied in the case of Context-Free Grammars (see for example [Roa01]), which are already top-down, but th...

On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms

We show how to encode context-free string grammars, linear contextfree tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a sec...

Derivational Minimalism Is Mildly Context-Sensitive

The change within the linguistic framework of transformational grammar from GB–theory to minimalism brought up a particular type of formal grammar, as well. We show that this type of a minimalist grammar (MG) constitutes a subclass of mildly context–sensitive grammars in the sense that for each MG there is a weakly equivalent linear context–free rewriting system (LCFRS). Moreover, an infinite h...

Optimal Parsing Strategies for Linear Context-Free Rewriting Systems

Reduction is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterminals on the production’s righthand side. Reduction lowers the rank of a production but may increase its fan-out. We show how to apply reduction in order to minimize the parsing complexity of the resulting grammar, and stu...